Course Overview
Introduction to Tree
Types of Tree
BST Traversal Techniques
BST Operations
Introduction to Level Order Traversal Pattern
Reverse Level Order Traversal easy
Solution Reverse Level Order Traversal
Find Largest Value in Each Tree Row medium
Solution Find Largest Value in Each Tree Row
Maximum Width of Binary Tree medium
Solution Maximum Width of Binary Tree
Maximum Level Sum of a Binary Tree medium
Solution Maximum Level Sum of a Binary Tree
Zigzag Traversal medium
Solution Zigzag Traversal
Even Odd Tree medium
Solution Even Odd Tree
N-ary Tree Level Order Traversal hard
Solution N-ary Tree Level Order Traversal
Introduction to Tree Depth Pattern
Maximum Depth or Height of Binary Tree easy
Solution Maximum Depth or Height of Binary Tree
Minimum Depth of a Binary Tree easy
Solution Minimum Depth of a Binary Tree
Balanced Binary Tree easy
Solution Balanced Binary Tree
Tree Diameter easy
Solution Tree Diameter
Maximum Depth of N-ary Tree easy
Solution Maximum Depth of N-ary Tree
Find maximum depth of subtree medium
Solution Find maximum depth of subtree
Introduction to Tree Breadth First Search Pattern
Sum of Nodes with Even-Valued Grandparent medium
Solution Sum of Nodes with Even-Valued Grandparent
All Nodes Distance K in Binary Tree medium
Solution All Nodes Distance K in Binary Tree
Level Order Successor easy
Solution Level Order Successor
Connect Level Order Siblings medium
Solution Connect Level Order Siblings
Connect All Level Order Siblings medium
Solution Connect All Level Order Siblings
Introduction to Tree Depth First Search Pattern
Binary Tree Path Sum easy
Solution Binary Tree Path Sum
Count Good Nodes in Binary Tree medium
Solution Count Good Nodes in Binary Tree
Path Sum III medium
Solution Path Sum III
Validate Binary Search Tree medium
Solution Validate Binary Search Tree
Maximum Difference Between Node and Ancestor medium
Solution Maximum Difference Between Node and Ancestor
Introduction to Root to Leaf Path Pattern
Binary Tree Paths easy
Solution Binary Tree Paths
Sum of Root To Leaf Binary Numbers easy
Solution Sum of Root To Leaf Binary Numbers
Insufficient Nodes in Root to Leaf Paths medium
Solution Insufficient Nodes in Root to Leaf Paths
Smallest String Starting From Leaf medium
Solution Smallest String Starting From Leaf
Pseudo-Palindromic Paths in a Binary Tree medium
Solution Pseudo-Palindromic Paths in a Binary Tree
All Paths for a Sum medium
Solution All Paths for a Sum
Sum of Path Numbers medium
Solution Sum of Path Numbers
Path With Given Sequence medium
Solution Path With Given Sequence
Count Paths for a Sum medium
Solution Count Paths for a Sum
Introduction to Leaf Processing Pattern
Sum of Left Leaves easy
Solution Sum of Left Leaves
Leaf-Similar Trees easy
Solution Leaf-Similar Trees
Check if all leaves are at same level medium
Solution Check if all leaves are at same level
Delete Leaves With a Given Value medium
Solution Delete Leaves With a Given Value
Deepest Leaves Sum medium
Solution Deepest Leaves Sum
Introduction to Tree View Pattern
Right View of a Binary Tree medium
Solution Right View of a Binary Tree
Top View Of the Binary Tree medium
Solution Top View Of the Binary Tree
Bottom View Of the Binary Tree medium
Solution Bottom View Of the Binary Tree
Boundary of Binary Tree medium
Solution Boundary of Binary Tree
Introduction to Comparison of Two Trees Pattern
Symmetric Tree easy
Solution Symmetric Tree
Mirror Image Trees medium
Solution Mirror Image Trees
Subtree of Another Tree easy
Solution Subtree of Another Tree
Isomorphic Trees medium
Solution Isomorphic Trees
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST medium
Solution Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree medium
Solution Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions medium
Solution Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree hard
Solution Serialize and Deserialize N-ary Tree